A Simple and Tractable Extension of Situation Calculus to Epistemic Logic
نویسندگان
چکیده
منابع مشابه
From Situation Calculus to Dynamic Epistemic Logic
We start from Reiter’s solution to the frame problem in terms of successor state axioms and Scherl& Levesque’s extension to knowledge, as formulated by Lakemeyer&Levesque in their logic ES. While it was believed up to now that quantification over actions is a characteristic feature of Reiter’s solution, we here show that for a reasonably large subset of Reiter’s basic action theories one can do...
متن کاملIncorporating Action Models into the Situation Calculus
While both situation calculus and dynamic epistemic logics (DELs) are concerned with reasoning about actions and their effects, historically, the emphasis of situation calculus was on physical actions in the single-agent case, in contrast, DELs focused on epistemic actions in the multi-agent case. In recent years, crossfertilization between the two areas has begun to attract attention. In this ...
متن کاملComplex Epistemic Modalities in the Situation Calculus
We develop a formal account of complex group-level epistemic modalities in the situation calculus, with a particular focus on reasoning about common knowledge. Expressions involving common knowledge cannot be handled by standard regression techniques and are thus difficult to reason about effectively. Taking our cue from recent promising work in dynamic epistemic logic, we overcome this limitat...
متن کاملThe Expressive Power of Epistemic $μ$-Calculus
While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...
متن کاملThe Expressive Power of Epistemic $\mu$-Calculus
While the μ-calculus notoriously subsumes Alternating-time Temporal Logic (ATL), we show that the epistemic μ-calculus does not subsume ATL with imperfect information (ATLi), for the synchronous perfect-recall semantics. To prove this we first establish that jumping parity tree automata (JTA), a recently introduced extension of alternating parity tree automata, are expressively equivalent to th...
متن کامل